Meyniel Weakly Triangulated Graphs - I: Co-perfect Orderability
نویسنده
چکیده
We show that Meyniel weakly triangulated graphs are co-perfectly orderable (equivalently , that P 5-free weakly triangulated graphs are perfectly orderable). Our proof is algorithmic, and relies on a notion concerning separating sets, a property of weakly triangulated graphs, and several properties of Meyniel weakly triangulated graphs.
منابع مشابه
Meyniel Weakly Triangulated Graphs II: A Theorem of Dirac
We generalize a theorem due to Dirac and show that every Meyniel weakly triangu-lated graph has some vertex which is not the middle vertex of any P 5. Our main tool is a separating set notion known as a handle.
متن کاملPrecoloring Extension of Co-Meyniel Graphs
The pre-coloring extension problem consists, given a graph G and a subset of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of colors which respects the pre-coloring assignment. This can be reduced to the usual coloring problem on a certain contracted graph. We prove that pre-coloring extension is polynomial for complements of Meyniel graphs....
متن کاملPrecoloring co-Meyniel graphs
The pre-coloring extension problem consists, given a graph G and a subset of nodes to which some colors are already assigned, in nding a coloring of G with the minimum number of colors which respects the pre-coloring assignment. This can be reduced to the usual coloring problem on a certain contracted graph. We prove that pre-coloring extension is polynomial for complements of Meyniel graphs. W...
متن کاملANNEGRET K . WAGLER Critical and Anticritical Edges with respect to Perfectness
We call an edge e of a perfect graph G critical if G e is imperfect and call e anticritical if G + e is imperfect. The present paper surveys several questions in this context. We ask in which perfect graphs critical and anticritical edges occur and how to detect such edges. The main result by Hougardy & Wagler [32] shows that a graph does not admit any critical edge if and only if it is Meyniel...
متن کاملOn Roussel-Rubio-type lemmas and their consequences
Roussel and Rubio proved a lemma which is essential in the proof of the Strong Perfect Graph Theorem. We give a new short proof of the main case of this lemma. In this note, we also give a short proof of Hayward’s decomposition theorem for weakly chordal graphs, relying on a Roussel–Rubio-type lemma. We recall how Roussel–Rubio-type lemmas yield very short proofs of the existence of even pairs ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 73 شماره
صفحات -
تاریخ انتشار 1997